By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 12, Issue 3, pp. 411-609

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets

Yaacov Yesha

pp. 411-425

BibTeX  Abstract Full Text:  PDF

Construction of Optimal $\alpha $-$\beta $ Leaf Trees with Applications to Prefix Code and Information Retrieval

David M. Choy and C. K. Wong

pp. 426-446

BibTeX  Abstract Full Text:  PDF

Optimal Placement for River Routing

Charles E. Leiserson and Ron Y. Pinter

pp. 447-462

BibTeX  Abstract Full Text:  PDF

Optimal Dynamic Embedding of Trees into Arrays

Michael C. Loui

pp. 463-472

BibTeX  Abstract Full Text:  PDF

A Generalized Class of Polynomials that are Hard to Factor

Erich Kaltofen, David R. Musser, and B. David Saunders

pp. 473-483

BibTeX  Abstract Full Text:  PDF

Multidimensional Sorting

Jacob E. Goodman and Richard Pollack

pp. 484-507

BibTeX  Abstract Full Text:  PDF

Shelf Algorithms for Two-Dimensional Packing Problems

Brenda S. Baker and Jerald S. Schwarz

pp. 508-525

BibTeX  Abstract Full Text:  PDF

On the Selection of Test Data for Vector-Valued Recursive Subroutines

John H. Rowland and Leslie E. Shader

pp. 526-538

BibTeX  Abstract Full Text:  PDF

One Step Transformation of Periodic Sequences by Cellular Automata

Hisao Yamada and Masatosi Imori

pp. 539-550

BibTeX  Abstract Full Text:  PDF

Tree Traversal Related Algorithms for Generating Integer Partitions

Trevor I. Fenner and Georghios Loizou

pp. 551-564

BibTeX  Abstract Full Text:  PDF

Positive Relativizations of Complexity Classes

Alan L. Selman, Xu Mei-Rui, and Ronald V. Book

pp. 565-579

BibTeX  Abstract Full Text:  PDF

Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets

Esko Ukkonen

pp. 580-587

BibTeX  Abstract Full Text:  PDF

A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$

Peter A. Bloniarz

pp. 588-600

BibTeX  Abstract Full Text:  PDF

On the Complexity of General Graph Factor Problems

D. G. Kirkpatrick and P. Hell

pp. 601-609

BibTeX  Abstract Full Text:  PDF